A generalisation of Turyn’s construction of self-dual codes
نویسنده
چکیده
In [17] Turyn constructed the famous binary Golay code of length 24 from the extended Hamming code of length 8 (see also [10, Theorem 18.7.12]). The present note interprets this construction as a sum of tensor products of codes and uses it to construct certain new extremal (or at least very good) self-dual codes (for example an extremal doubly-even binary code of length 80). The lattice counterpart of this construction has been described by Quebbemann [13]. It was used recently to construct an extremal even unimodular lattice in dimension 72 ([12]).
منابع مشابه
Constacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملAn Efficient Construction of Self-Dual Codes
We complete the building-up construction for self-dual codes by resolving the open cases over GF (q) with q ≡ 3 (mod 4), and over Zpm and Galois rings GR(p, r) with an odd prime p satisfying p ≡ 3 (mod 4) with r odd. We also extend the buildingup construction for self-dual codes to finite chain rings. Our building-up construction produces many new interesting self-dual codes. In particular, we ...
متن کاملConstruction of Self-dual Codes over $F_p+vF_p$
In this paper, we determine all self-dual codes over Fp + vFp (v 2 = v) in terms of self-dual codes over the finite field Fp and give an explicit construction for self-dual codes over Fp + vFp, where p is a prime.
متن کاملConstruction of MDS self-dual codes over Galois rings
The purpose of this paper is to construct nontrivial MDS self-dual codes over Galois rings. We consider a building-up construction of self-dual codes over Galois rings as a GF(q)-analogue of [20]. We give a necessary and sufficient condition on which the building-up construction holds. We construct MDS self-dual codes of lengths up to 8 over GR(3, 2), GR(3, 2) and GR(3, 2), and near-MDS self-du...
متن کاملArithmetic Constructions Of Binary Self-Dual Codes
The goal of this thesis is to explore the interplay between binary self-dual codes and the \'etale cohomology of arithmetic schemes. Three constructions of binary self-dual codes with arithmetic origins are proposed and compared: Construction $\Q$, Construction G and the Equivariant Construction. In this thesis, we prove that up to equivalence, all binary self-dual codes of length at least $4$ ...
متن کامل